<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>nih: linalg/sparse_matrix.h Source File</title>

<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
  $(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>

</head>
<body>
<div id="top"><!-- do not remove this div! -->


<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  
  
  <td style="padding-left: 0.5em;">
   <div id="projectname">nih
   &#160;<span id="projectnumber">0.5</span>
   </div>
   
  </td>
  
  
  
 </tr>
 </tbody>
</table>
</div>

<!-- Generated by Doxygen 1.7.5.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="modules.html"><span>Modules</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
    </ul>
  </div>
</div>
<div id="side-nav" class="ui-resizable side-nav-resizable">
  <div id="nav-tree">
    <div id="nav-tree-contents">
    </div>
  </div>
  <div id="splitbar" style="-moz-user-select:none;" 
       class="ui-resizable-handle">
  </div>
</div>
<script type="text/javascript">
  initNavTree('sparse__matrix_8h.html','');
</script>
<div id="doc-content">
<div class="header">
  <div class="headertitle">
<div class="title">linalg/sparse_matrix.h</div>  </div>
</div>
<div class="contents">
<div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> * Copyright (c) 2010-2011, NVIDIA Corporation</span>
<a name="l00003"></a>00003 <span class="comment"> * All rights reserved.</span>
<a name="l00004"></a>00004 <span class="comment"> *</span>
<a name="l00005"></a>00005 <span class="comment"> * Redistribution and use in source and binary forms, with or without</span>
<a name="l00006"></a>00006 <span class="comment"> * modification, are permitted provided that the following conditions are met:</span>
<a name="l00007"></a>00007 <span class="comment"> *   * Redistributions of source code must retain the above copyright</span>
<a name="l00008"></a>00008 <span class="comment"> *     notice, this list of conditions and the following disclaimer.</span>
<a name="l00009"></a>00009 <span class="comment"> *   * Redistributions in binary form must reproduce the above copyright</span>
<a name="l00010"></a>00010 <span class="comment"> *     notice, this list of conditions and the following disclaimer in the</span>
<a name="l00011"></a>00011 <span class="comment"> *     documentation and/or other materials provided with the distribution.</span>
<a name="l00012"></a>00012 <span class="comment"> *   * Neither the name of NVIDIA Corporation nor the</span>
<a name="l00013"></a>00013 <span class="comment"> *     names of its contributors may be used to endorse or promote products</span>
<a name="l00014"></a>00014 <span class="comment"> *     derived from this software without specific prior written permission.</span>
<a name="l00015"></a>00015 <span class="comment"> *</span>
<a name="l00016"></a>00016 <span class="comment"> * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS &quot;AS IS&quot; AND</span>
<a name="l00017"></a>00017 <span class="comment"> * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED</span>
<a name="l00018"></a>00018 <span class="comment"> * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE</span>
<a name="l00019"></a>00019 <span class="comment"> * DISCLAIMED. IN NO EVENT SHALL &lt;COPYRIGHT HOLDER&gt; BE LIABLE FOR ANY</span>
<a name="l00020"></a>00020 <span class="comment"> * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES</span>
<a name="l00021"></a>00021 <span class="comment"> * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;</span>
<a name="l00022"></a>00022 <span class="comment"> * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND</span>
<a name="l00023"></a>00023 <span class="comment"> * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</span>
<a name="l00024"></a>00024 <span class="comment"> * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS</span>
<a name="l00025"></a>00025 <span class="comment"> * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span>
<a name="l00026"></a>00026 <span class="comment"> */</span>
<a name="l00027"></a>00027 
<a name="l00028"></a>00028 <span class="preprocessor">#pragma once</span>
<a name="l00029"></a>00029 <span class="preprocessor"></span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &lt;base/vector.h&gt;</span>
<a name="l00031"></a>00031 <span class="preprocessor">#include &lt;cmath&gt;</span>
<a name="l00032"></a>00032 
<a name="l00033"></a>00033 <span class="keyword">namespace </span>nih {
<a name="l00034"></a>00034 
<a name="l00035"></a><a class="code" href="structnih_1_1_sparse__matrix__entry.html">00035</a> <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span><a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>
<a name="l00036"></a>00036 {
<a name="l00037"></a>00037 <span class="keyword">public</span>:
<a name="l00038"></a>00038         <span class="keyword">inline</span>  <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a> (<span class="keywordtype">void</span>);
<a name="l00039"></a>00039         <span class="keyword">inline</span>  <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a> (int32 i, int32 j, <span class="keyword">const</span> T&amp; v);
<a name="l00040"></a>00040         <span class="keyword">inline</span>  <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a> (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; en);
<a name="l00041"></a>00041         <span class="keyword">inline</span> ~<a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a> ();
<a name="l00042"></a>00042 
<a name="l00043"></a>00043         <span class="keyword">inline</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; operator  = (<span class="keyword">const</span> T&amp; v);
<a name="l00044"></a>00044         <span class="keyword">inline</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; operator  = (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; en);
<a name="l00045"></a>00045         <span class="keyword">inline</span> <span class="keywordtype">bool</span>   operator == (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; en) <span class="keyword">const</span>;
<a name="l00046"></a>00046         <span class="keyword">inline</span> <span class="keywordtype">bool</span>   operator != (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry</a>&amp; en) <span class="keyword">const</span>;
<a name="l00047"></a>00047 
<a name="l00048"></a>00048         <span class="keyword">inline</span> int32     row   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00049"></a>00049         <span class="keyword">inline</span> int32     col   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00050"></a>00050         <span class="keyword">inline</span> <span class="keyword">const</span> T&amp; value (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00051"></a>00051 
<a name="l00052"></a>00052         <span class="keyword">inline</span> int32 <span class="keyword">set</span> (int32 i, int32 j, <span class="keyword">const</span> T&amp; v);
<a name="l00053"></a>00053 
<a name="l00054"></a>00054 <span class="keyword">public</span>:
<a name="l00055"></a>00055         int32 dRow;
<a name="l00056"></a>00056         int32 dCol;
<a name="l00057"></a>00057         T     dVal;
<a name="l00058"></a>00058 };
<a name="l00059"></a>00059 
<a name="l00060"></a><a class="code" href="structnih_1_1_sparse__matrix.html">00060</a> <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span><a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>
<a name="l00061"></a>00061 {
<a name="l00062"></a>00062 <span class="keyword">public</span>:
<a name="l00063"></a>00063         <span class="keyword">typedef</span> T value_type;
<a name="l00064"></a>00064 
<a name="l00065"></a>00065     <span class="keyword">typedef</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry&lt;T&gt;</a> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>;
<a name="l00066"></a>00066 
<a name="l00067"></a><a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">00067</a>         <span class="keyword">class </span><a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>
<a name="l00068"></a>00068         {
<a name="l00069"></a>00069         <span class="keyword">public</span>:
<a name="l00070"></a>00070                 <span class="keyword">typedef</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry&lt;T&gt;</a> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>;
<a name="l00071"></a>00071                 
<a name="l00072"></a>00072         <span class="keyword">public</span>:
<a name="l00073"></a>00073                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a> (<span class="keywordtype">void</span>);
<a name="l00074"></a>00074                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a> (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix&lt;T&gt;</a> *m, int32 k);
<a name="l00075"></a>00075                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a> (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; it);
<a name="l00076"></a>00076                 <span class="keyword">inline</span> ~<a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a> ();
<a name="l00077"></a>00077 
<a name="l00078"></a>00078                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator  = (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; it);
<a name="l00079"></a>00079                 <span class="keyword">inline</span> <span class="keywordtype">bool</span>           operator == (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; it) <span class="keyword">const</span>;
<a name="l00080"></a>00080                 <span class="keyword">inline</span> <span class="keywordtype">bool</span>           operator != (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; it) <span class="keyword">const</span>;
<a name="l00081"></a>00081 
<a name="l00082"></a>00082                 <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>&amp;   operator* (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00083"></a>00083 
<a name="l00084"></a>00084                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator++ (<span class="keywordtype">void</span>);
<a name="l00085"></a>00085                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator++ (<span class="keywordtype">int</span>);
<a name="l00086"></a>00086 
<a name="l00087"></a>00087                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator-- (<span class="keywordtype">void</span>);
<a name="l00088"></a>00088                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator-- (<span class="keywordtype">int</span>);
<a name="l00089"></a>00089 
<a name="l00090"></a>00090                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator+= (int32);
<a name="l00091"></a>00091                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp; operator-= (int32);
<a name="l00092"></a>00092 
<a name="l00093"></a>00093                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>  operator + (int32) <span class="keyword">const</span>;
<a name="l00094"></a>00094                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>  operator - (int32) <span class="keyword">const</span>;
<a name="l00095"></a>00095                 <span class="keyword">inline</span> int32           operator - (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1const__iterator.html">const_iterator</a>&amp;) <span class="keyword">const</span>;
<a name="l00096"></a>00096                 <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>&amp;   operator[] (int32) <span class="keyword">const</span>;
<a name="l00097"></a>00097 
<a name="l00098"></a>00098                 <span class="keyword">inline</span> int32     row   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00099"></a>00099                 <span class="keyword">inline</span> int32     col   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00100"></a>00100                 <span class="keyword">inline</span> <span class="keyword">const</span> T&amp; value (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00101"></a>00101 
<a name="l00102"></a>00102         <span class="keyword">private</span>:
<a name="l00103"></a>00103                 <span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix&lt;T&gt;</a> *dM;
<a name="l00104"></a>00104                 int32                   dK;
<a name="l00105"></a>00105         };
<a name="l00106"></a>00106 
<a name="l00107"></a><a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">00107</a>         <span class="keyword">class </span><a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>
<a name="l00108"></a>00108         {
<a name="l00109"></a>00109         <span class="keyword">public</span>:
<a name="l00110"></a>00110                 <span class="keyword">typedef</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Sparse_matrix_entry&lt;T&gt;</a> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>;
<a name="l00111"></a>00111 
<a name="l00112"></a>00112         <span class="keyword">public</span>:
<a name="l00113"></a>00113                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a> (<span class="keywordtype">void</span>);
<a name="l00114"></a>00114                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a> (<a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix&lt;T&gt;</a> *m, int32 k);
<a name="l00115"></a>00115                 <span class="keyword">inline</span>  <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a> (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; it);
<a name="l00116"></a>00116                 <span class="keyword">inline</span> ~<a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a> ();
<a name="l00117"></a>00117 
<a name="l00118"></a>00118                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator  = (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; it);
<a name="l00119"></a>00119                 <span class="keyword">inline</span> <span class="keywordtype">bool</span>      operator == (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; it) <span class="keyword">const</span>;
<a name="l00120"></a>00120                 <span class="keyword">inline</span> <span class="keywordtype">bool</span>      operator != (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; it) <span class="keyword">const</span>;
<a name="l00121"></a>00121 
<a name="l00122"></a>00122                 <span class="keyword">inline</span> <span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>&amp; operator* (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00123"></a>00123                 <span class="keyword">inline</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>&amp;       operator* (<span class="keywordtype">void</span>);
<a name="l00124"></a>00124 
<a name="l00125"></a>00125                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator++ (<span class="keywordtype">void</span>);
<a name="l00126"></a>00126                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator++ (<span class="keywordtype">int</span>);
<a name="l00127"></a>00127 
<a name="l00128"></a>00128                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator-- (<span class="keywordtype">void</span>);
<a name="l00129"></a>00129                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator-- (<span class="keywordtype">int</span>);
<a name="l00130"></a>00130 
<a name="l00131"></a>00131                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator+= (int32);
<a name="l00132"></a>00132                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp; operator-= (int32);
<a name="l00133"></a>00133 
<a name="l00134"></a>00134                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>  operator + (int32) <span class="keyword">const</span>;
<a name="l00135"></a>00135                 <span class="keyword">inline</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>  operator - (int32) <span class="keyword">const</span>;
<a name="l00136"></a>00136                 <span class="keyword">inline</span> int32      operator - (<span class="keyword">const</span> <a class="code" href="classnih_1_1_sparse__matrix_1_1iterator.html">iterator</a>&amp;) <span class="keyword">const</span>;
<a name="l00137"></a>00137                 <span class="keyword">inline</span> <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>&amp;    operator[] (int32) <span class="keyword">const</span>;
<a name="l00138"></a>00138 
<a name="l00139"></a>00139                 <span class="keyword">inline</span> int32     row   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00140"></a>00140                 <span class="keyword">inline</span> int32     col   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00141"></a>00141                 <span class="keyword">inline</span> <span class="keyword">const</span> T&amp; value (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00142"></a>00142 
<a name="l00143"></a>00143                 <span class="keyword">inline</span> int32 <span class="keyword">set</span> (int32 i, int32 j, <span class="keyword">const</span> T&amp; v);
<a name="l00144"></a>00144 
<a name="l00145"></a>00145         <span class="keyword">private</span>:
<a name="l00146"></a>00146                 <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix&lt;T&gt;</a> *dM;
<a name="l00147"></a>00147                 int32             dK;
<a name="l00148"></a>00148         };
<a name="l00149"></a>00149 
<a name="l00150"></a>00150 <span class="keyword">public</span>:
<a name="l00151"></a>00151 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  ();
<a name="l00152"></a>00152 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (int32 n, int32 m, int32 size = 0);
<a name="l00153"></a>00153 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (<span class="keyword">const</span> <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix&lt;T&gt;</a>&amp;);
<a name="l00154"></a>00154 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (int32 n, int32 m, <span class="keyword">const</span> T  *v);
<a name="l00155"></a>00155 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (int32 n, int32 m, <span class="keyword">const</span> T **v);
<a name="l00156"></a>00156 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (int32 n, int32 m, int32 size, <span class="keyword">const</span> T *v, <span class="keyword">const</span> int32 *i, <span class="keyword">const</span> int32 *j);
<a name="l00157"></a>00157 <span class="keyword">inline</span>         <a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  (int32 n, int32 m, int32 size, <a class="code" href="structnih_1_1_sparse__matrix__entry.html">Entry</a>* e, int32 reference = 0);
<a name="l00158"></a>00158 <span class="keyword">inline</span>        ~<a class="code" href="structnih_1_1_sparse__matrix.html">Sparse_matrix</a>  ();
<a name="l00159"></a>00159 
<a name="l00160"></a>00160 <span class="keyword">inline</span>        <span class="keywordtype">void</span> resize (int32 n, int32 m);
<a name="l00161"></a>00161 <span class="keyword">inline</span>        <span class="keywordtype">void</span> resize (int32 n, int32 m, int32 size);
<a name="l00162"></a>00162 
<a name="l00163"></a>00163 <span class="keyword">inline</span>        int32 nRows (<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dRows; }
<a name="l00164"></a>00164 <span class="keyword">inline</span>        int32 nCols (<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dCols; }
<a name="l00165"></a>00165 <span class="keyword">inline</span>        int32 size  (<span class="keywordtype">void</span>)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> dSize; }
<a name="l00166"></a>00166 
<a name="l00167"></a>00167 <span class="keyword">inline</span>        Sparse_matrix&lt;T&gt;&amp;  operator  = (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;);
<a name="l00168"></a>00168 <span class="keyword">inline</span>        Sparse_matrix&lt;T&gt;&amp;  operator *= (<span class="keyword">const</span> T&amp;);
<a name="l00169"></a>00169 <span class="keyword">inline</span>        Sparse_matrix&lt;T&gt;&amp;  operator /= (<span class="keyword">const</span> T&amp;);
<a name="l00170"></a>00170 
<a name="l00171"></a>00171 <span class="keyword">inline</span>        Sparse_matrix&lt;T&gt;&amp;  transpose (<span class="keywordtype">void</span>);
<a name="l00172"></a>00172 
<a name="l00173"></a>00173 <span class="keyword">inline</span>        const_iterator begin (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00174"></a>00174 <span class="keyword">inline</span>        const_iterator end   (<span class="keywordtype">void</span>) <span class="keyword">const</span>;
<a name="l00175"></a>00175 <span class="keyword">inline</span>        iterator      begin (<span class="keywordtype">void</span>);
<a name="l00176"></a>00176 <span class="keyword">inline</span>        iterator      end   (<span class="keywordtype">void</span>);
<a name="l00177"></a>00177 <span class="keyword">inline</span>        <span class="keyword">const</span> Entry&amp;  operator [] (int32 i) <span class="keyword">const</span>;
<a name="l00178"></a>00178 <span class="keyword">inline</span>        Entry&amp;        operator [] (int32 i);
<a name="l00179"></a>00179 
<a name="l00180"></a>00180 <span class="keyword">friend</span> NIH_API_CS <span class="keywordtype">int</span>  operator == &lt;T&gt; (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;,  <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;);
<a name="l00181"></a>00181 <span class="keyword">friend</span> NIH_API_CS <span class="keywordtype">int</span>  operator != &lt;T&gt; (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;,  <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;);
<a name="l00182"></a>00182 
<a name="l00183"></a>00183 <span class="keyword">public</span>:
<a name="l00184"></a>00184         int32   dRows;
<a name="l00185"></a>00185         int32   dCols;
<a name="l00186"></a>00186         int32   dSize;
<a name="l00187"></a>00187         Entry *dEntries;
<a name="l00188"></a>00188         int32   dRef;
<a name="l00189"></a>00189 };
<a name="l00190"></a>00190 
<a name="l00191"></a>00191 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; ColVector&amp; mult  (<span class="keyword">const</span> RowVector&amp;,         <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;, ColVector&amp;);
<a name="l00192"></a>00192 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; RowVector&amp; mult  (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;, <span class="keyword">const</span> ColVector&amp;,         RowVector&amp;);
<a name="l00193"></a>00193 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; ColVector&amp; madd  (<span class="keyword">const</span> RowVector&amp;,         <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;, ColVector&amp;);
<a name="l00194"></a>00194 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; RowVector&amp; madd  (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;, <span class="keyword">const</span> ColVector&amp;,         RowVector&amp;);
<a name="l00195"></a>00195 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;&amp;  transpose (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp;,  Sparse_matrix&lt;T&gt;&amp;);
<a name="l00196"></a>00196 
<a name="l00197"></a>00197 
<a name="l00198"></a>00198 <span class="comment">//</span>
<a name="l00199"></a>00199 <span class="comment">// I M P L E M E N T A T I O N</span>
<a name="l00200"></a>00200 <span class="comment">//</span>
<a name="l00201"></a>00201 
<a name="l00202"></a>00202 <span class="comment">//</span>
<a name="l00203"></a>00203 <span class="comment">// Sparse_matrix inline methods</span>
<a name="l00204"></a>00204 <span class="comment">//</span>
<a name="l00205"></a>00205 
<a name="l00206"></a>00206 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix () :
<a name="l00207"></a>00207         dRows ( 0 ),
<a name="l00208"></a>00208         dCols ( 0 ),
<a name="l00209"></a>00209         dSize ( 0 ),
<a name="l00210"></a>00210         dEntries ( 0 ),
<a name="l00211"></a>00211         dRef     ( 0 )
<a name="l00212"></a>00212 {}
<a name="l00213"></a>00213 
<a name="l00214"></a>00214 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix  (int32 n, int32 m, int32 size) :
<a name="l00215"></a>00215         dRows ( n ),
<a name="l00216"></a>00216         dCols ( m ),
<a name="l00217"></a>00217         dSize ( size ),
<a name="l00218"></a>00218         dEntries ( 0 ),
<a name="l00219"></a>00219         dRef     ( 0 )
<a name="l00220"></a>00220 {
<a name="l00221"></a>00221         <span class="keywordflow">if</span> (dSize)
<a name="l00222"></a>00222                 dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00223"></a>00223 }
<a name="l00224"></a>00224 
<a name="l00225"></a>00225 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; m) :
<a name="l00226"></a>00226         dRows ( m.dRows ),
<a name="l00227"></a>00227         dCols ( m.dCols ),
<a name="l00228"></a>00228         dSize ( m.dSize ),
<a name="l00229"></a>00229         dEntries ( 0 ),
<a name="l00230"></a>00230         dRef     ( 0 )
<a name="l00231"></a>00231 {
<a name="l00232"></a>00232         dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00233"></a>00233 
<a name="l00234"></a>00234         int32 i;
<a name="l00235"></a>00235         <span class="keywordflow">for</span> (i = 0; i &lt; dSize; i++)
<a name="l00236"></a>00236                 dEntries[i] = m.dEntries[i];
<a name="l00237"></a>00237 <span class="comment">//      for (i = 0; i &lt; dRows; i++)</span>
<a name="l00238"></a>00238 <span class="comment">//              dRowPtr[i] = m.dRowPtr[i];</span>
<a name="l00239"></a>00239 }
<a name="l00240"></a>00240 
<a name="l00241"></a>00241 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix (int32 n, int32 m, <span class="keyword">const</span> T *a) :
<a name="l00242"></a>00242         dRows ( n ),
<a name="l00243"></a>00243         dCols ( m ),
<a name="l00244"></a>00244         dSize ( 0 ),
<a name="l00245"></a>00245         dEntries ( 0 ),
<a name="l00246"></a>00246         dRef     ( 0 )
<a name="l00247"></a>00247 {
<a name="l00248"></a>00248         int32 i, j;
<a name="l00249"></a>00249 
<a name="l00250"></a>00250         <span class="keywordflow">for</span> (i = 0; i &lt; n * m; i++)
<a name="l00251"></a>00251                 dSize += a[i] != 0 ? 1 : 0;
<a name="l00252"></a>00252 
<a name="l00253"></a>00253         dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00254"></a>00254 
<a name="l00255"></a>00255         int32 k = 0;
<a name="l00256"></a>00256         <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)
<a name="l00257"></a>00257         {
<a name="l00258"></a>00258 <span class="comment">//              dRowPtr[i] = k;</span>
<a name="l00259"></a>00259                 <span class="keywordflow">for</span> (j = 0; j &lt; m; j++)
<a name="l00260"></a>00260                 {
<a name="l00261"></a>00261                         <span class="keywordflow">if</span> (a[i*m + j] == 0)
<a name="l00262"></a>00262                                 <span class="keywordflow">continue</span>;
<a name="l00263"></a>00263 
<a name="l00264"></a>00264                         dEntries[k].dVal = a[i*m + j];
<a name="l00265"></a>00265                         dEntries[k].dRow = i;
<a name="l00266"></a>00266                         dEntries[k].dCol = j;
<a name="l00267"></a>00267                         k++;
<a name="l00268"></a>00268                 }
<a name="l00269"></a>00269         }
<a name="l00270"></a>00270 }
<a name="l00271"></a>00271 
<a name="l00272"></a>00272 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix (int32 n, int32 m, <span class="keyword">const</span> T **a) :
<a name="l00273"></a>00273         dRows ( n ),
<a name="l00274"></a>00274         dCols ( m ),
<a name="l00275"></a>00275         dSize ( 0 ),
<a name="l00276"></a>00276         dEntries ( 0 ),
<a name="l00277"></a>00277         dRef     ( 0 )
<a name="l00278"></a>00278 {
<a name="l00279"></a>00279         int32 i, j;
<a name="l00280"></a>00280 
<a name="l00281"></a>00281         <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)
<a name="l00282"></a>00282                 <span class="keywordflow">for</span> (j = 0; j &lt; m; j++)
<a name="l00283"></a>00283                         dSize += a[i][j] != 0 ? 1 : 0;
<a name="l00284"></a>00284 
<a name="l00285"></a>00285         dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00286"></a>00286 
<a name="l00287"></a>00287         int32 k = 0;
<a name="l00288"></a>00288         <span class="keywordflow">for</span> (i = 0; i &lt; n; i++)
<a name="l00289"></a>00289         {
<a name="l00290"></a>00290 <span class="comment">//              dRowPtr[i] = k;</span>
<a name="l00291"></a>00291                 <span class="keywordflow">for</span> (j = 0; j &lt; m; j++)
<a name="l00292"></a>00292                 {
<a name="l00293"></a>00293                         <span class="keywordflow">if</span> (a[i][j] == 0)
<a name="l00294"></a>00294                                 <span class="keywordflow">continue</span>;
<a name="l00295"></a>00295 
<a name="l00296"></a>00296                         dEntries[k].dVal = a[i][j];
<a name="l00297"></a>00297                         dEntries[k].dRow = i;
<a name="l00298"></a>00298                         dEntries[k].dCol = j;
<a name="l00299"></a>00299                         k++;
<a name="l00300"></a>00300                 }
<a name="l00301"></a>00301         }
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303 
<a name="l00304"></a>00304 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix  (int32 n, int32 m, int32 size, <span class="keyword">const</span> T *val, <span class="keyword">const</span> int32 *row, <span class="keyword">const</span> int32 *col) :
<a name="l00305"></a>00305         dRows ( n ),
<a name="l00306"></a>00306         dCols ( m ),
<a name="l00307"></a>00307         dSize ( size ),
<a name="l00308"></a>00308         dEntries ( 0 ),
<a name="l00309"></a>00309         dRef     ( 0 )
<a name="l00310"></a>00310 {
<a name="l00311"></a>00311         int32 i;
<a name="l00312"></a>00312 
<a name="l00313"></a>00313         dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00314"></a>00314 
<a name="l00315"></a>00315         <span class="keywordflow">for</span> (i = 0; i &lt; dSize; i++)
<a name="l00316"></a>00316         {
<a name="l00317"></a>00317                 dEntries[i].dVal = val[i];
<a name="l00318"></a>00318                 dEntries[i].dRow = row[i];
<a name="l00319"></a>00319                 dEntries[i].dCol = row[i];
<a name="l00320"></a>00320 
<a name="l00321"></a>00321 <span class="comment">//              dRowPtr[ ind[i]/dCols ]++;</span>
<a name="l00322"></a>00322         }
<a name="l00323"></a>00323         <span class="comment">// Sort dEntries based on dInd</span>
<a name="l00324"></a>00324         <span class="comment">// ...</span>
<a name="l00325"></a>00325 }
<a name="l00326"></a>00326 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::Sparse_matrix  (int32 n, int32 m, int32 size, Sparse_matrix_entry&lt;T&gt;* entries, int32 ref) :
<a name="l00327"></a>00327         dRows ( n ),
<a name="l00328"></a>00328         dCols ( m ),
<a name="l00329"></a>00329         dSize ( size ),
<a name="l00330"></a>00330         dEntries ( 0 ),
<a name="l00331"></a>00331         dRef     ( ref )
<a name="l00332"></a>00332 {
<a name="l00333"></a>00333         int32 i;
<a name="l00334"></a>00334 
<a name="l00335"></a>00335         <span class="keywordflow">if</span> (dRef)
<a name="l00336"></a>00336                 dEntries = entries;
<a name="l00337"></a>00337         <span class="keywordflow">else</span>
<a name="l00338"></a>00338         {
<a name="l00339"></a>00339                 dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00340"></a>00340                 
<a name="l00341"></a>00341                 <span class="keywordflow">for</span> (i = 0; i &lt; dSize; i++)
<a name="l00342"></a>00342                         dEntries[i] = entries[i];
<a name="l00343"></a>00343         }
<a name="l00344"></a>00344         <span class="comment">// Sort dEntries based on dInd</span>
<a name="l00345"></a>00345         <span class="comment">// ...</span>
<a name="l00346"></a>00346 }
<a name="l00347"></a>00347 
<a name="l00348"></a>00348 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;::~Sparse_matrix()
<a name="l00349"></a>00349 {
<a name="l00350"></a>00350         <span class="keywordflow">if</span> (! dRef)
<a name="l00351"></a>00351                 <span class="keyword">delete</span> [] dEntries;
<a name="l00352"></a>00352 }
<a name="l00353"></a>00353 
<a name="l00354"></a>00354 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keywordtype">void</span> Sparse_matrix&lt;T&gt;::resize (int32 n, int32 m)
<a name="l00355"></a>00355 {
<a name="l00356"></a>00356         dRows = n;
<a name="l00357"></a>00357         dCols = m;
<a name="l00358"></a>00358 }
<a name="l00359"></a>00359 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keywordtype">void</span> Sparse_matrix&lt;T&gt;::resize (int32 n, int32 m, int32 size)
<a name="l00360"></a>00360 {
<a name="l00361"></a>00361         dRows = n;
<a name="l00362"></a>00362         dCols = m;
<a name="l00363"></a>00363 
<a name="l00364"></a>00364         <span class="keywordflow">if</span> (dSize != size)
<a name="l00365"></a>00365         {
<a name="l00366"></a>00366                 <span class="keywordflow">if</span> (dRef)
<a name="l00367"></a>00367                 {
<a name="l00368"></a>00368                         dSize = 0;
<a name="l00369"></a>00369                         dRef  = 0;
<a name="l00370"></a>00370                         dEntries = 0;
<a name="l00371"></a>00371                 }
<a name="l00372"></a>00372 
<a name="l00373"></a>00373                 dSize = size;
<a name="l00374"></a>00374                 <span class="keyword">delete</span> [] dEntries;
<a name="l00375"></a>00375 
<a name="l00376"></a>00376                 dEntries = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00377"></a>00377                 dRef = 0;
<a name="l00378"></a>00378         }
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380 
<a name="l00381"></a>00381 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::operator  = (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; m)
<a name="l00382"></a>00382 {
<a name="l00383"></a>00383         <span class="keywordflow">if</span> (dRef)
<a name="l00384"></a>00384         {
<a name="l00385"></a>00385                 dSize = 0;
<a name="l00386"></a>00386                 dRef  = 0;
<a name="l00387"></a>00387                 dEntries = 0;
<a name="l00388"></a>00388         }
<a name="l00389"></a>00389 
<a name="l00390"></a>00390         <span class="keywordflow">if</span> (dSize != m.dSize)
<a name="l00391"></a>00391         {
<a name="l00392"></a>00392                 <span class="keyword">delete</span> [] dEntries;
<a name="l00393"></a>00393                 dSize = m.dSize;
<a name="l00394"></a>00394                 dEntries  = <span class="keyword">new</span> Entry [ dSize ];
<a name="l00395"></a>00395         }
<a name="l00396"></a>00396 <span class="comment">/*      if (dRows != m.dRows)</span>
<a name="l00397"></a>00397 <span class="comment">        {</span>
<a name="l00398"></a>00398 <span class="comment">                delete [] dRowPtr;</span>
<a name="l00399"></a>00399 <span class="comment"></span>
<a name="l00400"></a>00400 <span class="comment">                dRows = m.dRows;</span>
<a name="l00401"></a>00401 <span class="comment">                dRowPtr = new int32 [ dRows ];</span>
<a name="l00402"></a>00402 <span class="comment">        }*/</span>
<a name="l00403"></a>00403         dRows = m.dRows;
<a name="l00404"></a>00404         dCols = m.dCols;
<a name="l00405"></a>00405 
<a name="l00406"></a>00406         int32 i;
<a name="l00407"></a>00407         <span class="keywordflow">for</span> (i = 0; i &lt; dSize; i++)
<a name="l00408"></a>00408                 dEntries[i] = m.dEntries[i];
<a name="l00409"></a>00409 
<a name="l00410"></a>00410 <span class="comment">//      for (i = 0; i &lt; dRows; i++)</span>
<a name="l00411"></a>00411 <span class="comment">//              dRowPtr[i] = m.dRowPtr[i];</span>
<a name="l00412"></a>00412 
<a name="l00413"></a>00413         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00414"></a>00414 }
<a name="l00415"></a>00415 
<a name="l00416"></a>00416 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;&amp; <a class="code" href="group__vectors.html#gabaaa34dafadbdbaaff130b02d28b3ad1">Sparse_matrix&lt;T&gt;::operator *= </a>(<span class="keyword">const</span> T&amp; k)
<a name="l00417"></a>00417 {
<a name="l00418"></a>00418         <span class="keywordflow">for</span> (int32 i = 0; i &lt; dSize; i++)
<a name="l00419"></a>00419                 dEntries[i].dVal *= k;
<a name="l00420"></a>00420 
<a name="l00421"></a>00421         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00422"></a>00422 }
<a name="l00423"></a>00423 
<a name="l00424"></a>00424 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;&amp; <a class="code" href="group__vectors.html#ga04e63000d70a03c13098b6b7303a29e9">Sparse_matrix&lt;T&gt;::operator /= </a>(<span class="keyword">const</span> T&amp; k)
<a name="l00425"></a>00425 {
<a name="l00426"></a>00426         <span class="keywordflow">for</span> (int32 i = 0; i &lt; dSize; i++)
<a name="l00427"></a>00427                 dEntries[i].dVal /= k;
<a name="l00428"></a>00428 
<a name="l00429"></a>00429         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00430"></a>00430 }
<a name="l00431"></a>00431 
<a name="l00432"></a>00432 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::transpose (<span class="keywordtype">void</span>)
<a name="l00433"></a>00433 {
<a name="l00434"></a>00434         int32 k, tmp;
<a name="l00435"></a>00435         <span class="keywordflow">for</span> (k = 0; k &lt; dSize; k++)
<a name="l00436"></a>00436         {
<a name="l00437"></a>00437                 tmp              = dEntries[k].dRow;
<a name="l00438"></a>00438                 dEntries[k].dRow = dEntries[k].dCol;
<a name="l00439"></a>00439                 dEntries[k].dCol = tmp;
<a name="l00440"></a>00440         }
<a name="l00441"></a>00441         tmp = dRows;
<a name="l00442"></a>00442         dRows = dCols;
<a name="l00443"></a>00443         dCols = tmp;
<a name="l00444"></a>00444 
<a name="l00445"></a>00445         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00446"></a>00446 }
<a name="l00447"></a>00447 
<a name="l00448"></a>00448 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator Sparse_matrix&lt;T&gt;::begin (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00449"></a>00449 <span class="keyword"></span>{
<a name="l00450"></a>00450         <span class="keywordflow">return</span> const_iterator( <span class="keyword">this</span>, 0 );
<a name="l00451"></a>00451 }
<a name="l00452"></a>00452 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator Sparse_matrix&lt;T&gt;::end (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00453"></a>00453 <span class="keyword"></span>{
<a name="l00454"></a>00454         <span class="keywordflow">return</span> const_iterator( <span class="keyword">this</span>, dSize );
<a name="l00455"></a>00455 }
<a name="l00456"></a>00456 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator Sparse_matrix&lt;T&gt;::begin (<span class="keywordtype">void</span>)
<a name="l00457"></a>00457 {
<a name="l00458"></a>00458         <span class="keywordflow">return</span> iterator( <span class="keyword">this</span>, 0 );
<a name="l00459"></a>00459 }
<a name="l00460"></a>00460 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator Sparse_matrix&lt;T&gt;::end (<span class="keywordtype">void</span>)
<a name="l00461"></a>00461 {
<a name="l00462"></a>00462         <span class="keywordflow">return</span> iterator( <span class="keyword">this</span>, dSize );
<a name="l00463"></a>00463 }
<a name="l00464"></a>00464 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; <span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::operator [] (int32 i)<span class="keyword"> const</span>
<a name="l00465"></a>00465 <span class="keyword"></span>{
<a name="l00466"></a>00466         <span class="keywordflow">return</span> dEntries[i];
<a name="l00467"></a>00467 }
<a name="l00468"></a>00468 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::operator [] (int32 i)
<a name="l00469"></a>00469 {
<a name="l00470"></a>00470         <span class="keywordflow">return</span> dEntries[i];
<a name="l00471"></a>00471 }
<a name="l00472"></a>00472 
<a name="l00473"></a>00473 <span class="comment">//</span>
<a name="l00474"></a>00474 <span class="comment">// Sparse_matrix template &lt; typename T &gt; functions (not members)</span>
<a name="l00475"></a>00475 <span class="comment">//</span>
<a name="l00476"></a>00476 
<a name="l00477"></a>00477 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; NIH_API_CS <span class="keywordtype">int</span> operator == (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; a, <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; b)
<a name="l00478"></a>00478 {
<a name="l00479"></a>00479         int32 sz = a.dSize;
<a name="l00480"></a>00480         <span class="keywordflow">if</span> (sz != b.dSize || a.dRows != b.dRows || a.dCols != b.dCols)
<a name="l00481"></a>00481                 <span class="keywordflow">return</span> 0;
<a name="l00482"></a>00482 
<a name="l00483"></a>00483         int32 i;
<a name="l00484"></a>00484         <span class="keywordflow">for</span> (i = 0; i &lt; sz; i++)
<a name="l00485"></a>00485         {
<a name="l00486"></a>00486                 <span class="keywordflow">if</span> (a.dEntries[i] != b.dEntries[i])
<a name="l00487"></a>00487                         <span class="keywordflow">return</span> 0;
<a name="l00488"></a>00488         }
<a name="l00489"></a>00489         <span class="keywordflow">return</span> 1;
<a name="l00490"></a>00490 }
<a name="l00491"></a>00491 
<a name="l00492"></a>00492 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> T &gt; NIH_API_CS <span class="keywordtype">int</span> operator != (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; a, <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; b)
<a name="l00493"></a>00493 {
<a name="l00494"></a>00494         <span class="keywordflow">return</span> !(a == b);
<a name="l00495"></a>00495 }
<a name="l00496"></a>00496 
<a name="l00497"></a>00497 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; ColVector&amp; mult (<span class="keyword">const</span> RowVector&amp; v, <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, ColVector&amp; r)
<a name="l00498"></a>00498 {
<a name="l00499"></a>00499         int32 k, i, j;
<a name="l00500"></a>00500 
<a name="l00501"></a>00501         r.resize( A.dCols );
<a name="l00502"></a>00502         <span class="keywordflow">for</span> (i = 0; i &lt; A.dCols; i++)
<a name="l00503"></a>00503                 r[i] = 0.0;
<a name="l00504"></a>00504 
<a name="l00505"></a>00505         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00506"></a>00506         {
<a name="l00507"></a>00507                 i = A.dEntries[k].dRow;
<a name="l00508"></a>00508                 j = A.dEntries[k].dCol;
<a name="l00509"></a>00509 
<a name="l00510"></a>00510                 r[j] += A.dEntries[k].dVal * v[i];
<a name="l00511"></a>00511         }
<a name="l00512"></a>00512         <span class="keywordflow">return</span> r;
<a name="l00513"></a>00513 }
<a name="l00514"></a>00514 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; RowVector&amp; mult (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, <span class="keyword">const</span> ColVector&amp; v, RowVector&amp; r)
<a name="l00515"></a>00515 {
<a name="l00516"></a>00516         int32 k, i, j;
<a name="l00517"></a>00517 
<a name="l00518"></a>00518         r.resize( A.dRows );
<a name="l00519"></a>00519         <span class="keywordflow">for</span> (i = 0; i &lt; A.dRows; i++)
<a name="l00520"></a>00520                 r[i] = 0.0;
<a name="l00521"></a>00521 
<a name="l00522"></a>00522         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00523"></a>00523         {
<a name="l00524"></a>00524                 i = A.dEntries[k].dRow;
<a name="l00525"></a>00525                 j = A.dEntries[k].dCol;
<a name="l00526"></a>00526 
<a name="l00527"></a>00527                 r[i] += A.dEntries[k].dVal * v[j];
<a name="l00528"></a>00528         }
<a name="l00529"></a>00529         <span class="keywordflow">return</span> r;
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; ColVector&amp; madd (<span class="keyword">const</span> RowVector&amp; v, <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, ColVector&amp; r)
<a name="l00532"></a>00532 {
<a name="l00533"></a>00533         int32 k, i, j;
<a name="l00534"></a>00534 
<a name="l00535"></a>00535         r.resize( A.dCols );
<a name="l00536"></a>00536         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00537"></a>00537         {
<a name="l00538"></a>00538                 i = A.dEntries[k].dRow;
<a name="l00539"></a>00539                 j = A.dEntries[k].dCol;
<a name="l00540"></a>00540 
<a name="l00541"></a>00541                 r[j] += A.dEntries[k].dVal * v[i];
<a name="l00542"></a>00542         }
<a name="l00543"></a>00543         <span class="keywordflow">return</span> r;
<a name="l00544"></a>00544 }
<a name="l00545"></a>00545 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> RowVector, <span class="keyword">class</span> ColVector&gt; RowVector&amp; madd (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, <span class="keyword">const</span> ColVector&amp; v, RowVector&amp; r)
<a name="l00546"></a>00546 {
<a name="l00547"></a>00547         int32 k, i, j;
<a name="l00548"></a>00548 
<a name="l00549"></a>00549         r.resize( A.dRows );
<a name="l00550"></a>00550         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00551"></a>00551         {
<a name="l00552"></a>00552                 i = A.dEntries[k].dRow;
<a name="l00553"></a>00553                 j = A.dEntries[k].dCol;
<a name="l00554"></a>00554 
<a name="l00555"></a>00555                 r[i] += A.dEntries[k].dVal * v[j];
<a name="l00556"></a>00556         }
<a name="l00557"></a>00557         <span class="keywordflow">return</span> r;
<a name="l00558"></a>00558 }
<a name="l00559"></a>00559 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;&amp; transpose (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, Sparse_matrix&lt;T&gt;&amp; B)
<a name="l00560"></a>00560 {
<a name="l00561"></a>00561         B = A;
<a name="l00562"></a>00562         <span class="keywordflow">return</span> B.transpose();
<a name="l00563"></a>00563 }
<a name="l00564"></a>00564 
<a name="l00565"></a>00565 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> Vector&gt; Vector operator* (<span class="keyword">const</span> Vector v, <span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A)
<a name="l00566"></a>00566 {
<a name="l00567"></a>00567     Vector r;
<a name="l00568"></a>00568         int32 k, i, j;
<a name="l00569"></a>00569 
<a name="l00570"></a>00570         r.resize( A.dCols );
<a name="l00571"></a>00571         <span class="keywordflow">for</span> (i = 0; i &lt; A.dCols; i++)
<a name="l00572"></a>00572                 r[i] = 0.0;
<a name="l00573"></a>00573 
<a name="l00574"></a>00574         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00575"></a>00575         {
<a name="l00576"></a>00576                 i = A.dEntries[k].dRow;
<a name="l00577"></a>00577                 j = A.dEntries[k].dCol;
<a name="l00578"></a>00578 
<a name="l00579"></a>00579                 r[j] += A.dEntries[k].dVal * v[i];
<a name="l00580"></a>00580         }
<a name="l00581"></a>00581         <span class="keywordflow">return</span> r;
<a name="l00582"></a>00582 }
<a name="l00583"></a>00583 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> Vector&gt; Vector operator* (<span class="keyword">const</span> Sparse_matrix&lt;T&gt;&amp; A, <span class="keyword">const</span> Vector&amp; v)
<a name="l00584"></a>00584 {
<a name="l00585"></a>00585     Vector r;
<a name="l00586"></a>00586         int32 k, i, j;
<a name="l00587"></a>00587 
<a name="l00588"></a>00588         r.resize( A.dRows );
<a name="l00589"></a>00589         <span class="keywordflow">for</span> (i = 0; i &lt; A.dRows; i++)
<a name="l00590"></a>00590                 r[i] = 0.0;
<a name="l00591"></a>00591 
<a name="l00592"></a>00592         <span class="keywordflow">for</span> (k = 0; k &lt; A.dSize; k++)
<a name="l00593"></a>00593         {
<a name="l00594"></a>00594                 i = A.dEntries[k].dRow;
<a name="l00595"></a>00595                 j = A.dEntries[k].dCol;
<a name="l00596"></a>00596 
<a name="l00597"></a>00597                 r[i] += A.dEntries[k].dVal * v[j];
<a name="l00598"></a>00598         }
<a name="l00599"></a>00599         <span class="keywordflow">return</span> r;
<a name="l00600"></a>00600 }
<a name="l00601"></a>00601 
<a name="l00602"></a>00602 
<a name="l00603"></a>00603 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;::Sparse_matrix_entry (<span class="keywordtype">void</span>) :
<a name="l00604"></a>00604         dRow( 0 ),
<a name="l00605"></a>00605         dCol( 0 ),
<a name="l00606"></a>00606         dVal( 0 )
<a name="l00607"></a>00607 {
<a name="l00608"></a>00608 }
<a name="l00609"></a>00609 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;::Sparse_matrix_entry (int32 i, int32 j, <span class="keyword">const</span> T&amp; v) :
<a name="l00610"></a>00610         dRow( i ),
<a name="l00611"></a>00611         dCol( j ),
<a name="l00612"></a>00612         dVal( v )
<a name="l00613"></a>00613 {
<a name="l00614"></a>00614 }
<a name="l00615"></a>00615 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;::Sparse_matrix_entry (<span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; it) :
<a name="l00616"></a>00616         dRow( it.dRow ),
<a name="l00617"></a>00617         dCol( it.dCol ),
<a name="l00618"></a>00618         dVal( it.dVal )
<a name="l00619"></a>00619 {
<a name="l00620"></a>00620 }
<a name="l00621"></a>00621 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;::~Sparse_matrix_entry ()
<a name="l00622"></a>00622 {
<a name="l00623"></a>00623 }
<a name="l00624"></a>00624 
<a name="l00625"></a>00625 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix_entry&lt;T&gt;::operator = (<span class="keyword">const</span> T&amp; v)
<a name="l00626"></a>00626 {
<a name="l00627"></a>00627         dVal = v;
<a name="l00628"></a>00628         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00629"></a>00629 }
<a name="l00630"></a>00630 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix_entry&lt;T&gt;::operator = (<span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; it)
<a name="l00631"></a>00631 {
<a name="l00632"></a>00632         dRow = it.dRow;
<a name="l00633"></a>00633         dCol = it.dCol;
<a name="l00634"></a>00634         dVal = it.dVal;
<a name="l00635"></a>00635         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00636"></a>00636 }
<a name="l00637"></a>00637 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> <a class="code" href="group__vectors.html#gaabd17838f41c1637cb84a3cfe31dfb0b">Sparse_matrix_entry&lt;T&gt;::operator == </a>(<span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; it)<span class="keyword"> const</span>
<a name="l00638"></a>00638 <span class="keyword"></span>{
<a name="l00639"></a>00639         <span class="keywordflow">return</span> (dRow == it.dRow) &amp;&amp; (dCol == it.dCol) &amp;&amp; (dVal == it.dVal);
<a name="l00640"></a>00640 }
<a name="l00641"></a>00641 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> <a class="code" href="group__vectors.html#ga884852dfe6e126e524af6c966fd3fa8e">Sparse_matrix_entry&lt;T&gt;::operator != </a>(<span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; it)<span class="keyword"> const</span>
<a name="l00642"></a>00642 <span class="keyword"></span>{
<a name="l00643"></a>00643         <span class="keywordflow">return</span> (dRow != it.dRow) || (dCol != it.dCol) || (dVal != it.dVal);
<a name="l00644"></a>00644 }
<a name="l00645"></a>00645 
<a name="l00646"></a>00646 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix_entry&lt;T&gt;::row (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00647"></a>00647 <span class="keyword"></span>{
<a name="l00648"></a>00648         <span class="keywordflow">return</span> dRow;
<a name="l00649"></a>00649 }
<a name="l00650"></a>00650 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix_entry&lt;T&gt;::col (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00651"></a>00651 <span class="keyword"></span>{
<a name="l00652"></a>00652         <span class="keywordflow">return</span> dCol;
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> T&amp; Sparse_matrix_entry&lt;T&gt;::value (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00655"></a>00655 <span class="keyword"></span>{
<a name="l00656"></a>00656         <span class="keywordflow">return</span> dVal;
<a name="l00657"></a>00657 }
<a name="l00658"></a>00658 
<a name="l00659"></a>00659 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix_entry&lt;T&gt;::set (int32 i, int32 j, <span class="keyword">const</span> T&amp; v)
<a name="l00660"></a>00660 {
<a name="l00661"></a>00661         dRow = i;
<a name="l00662"></a>00662         dCol = j;
<a name="l00663"></a>00663         dVal = v;
<a name="l00664"></a>00664 }
<a name="l00665"></a>00665 
<a name="l00666"></a>00666 
<a name="l00667"></a>00667 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::iterator::iterator (<span class="keywordtype">void</span>) :
<a name="l00668"></a>00668         dM( 0 ),
<a name="l00669"></a>00669         dK( 0 )
<a name="l00670"></a>00670 {
<a name="l00671"></a>00671 }
<a name="l00672"></a>00672 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::iterator::iterator (Sparse_matrix&lt;T&gt; *m, int32 k) :
<a name="l00673"></a>00673         dM( m ),
<a name="l00674"></a>00674         dK( k )
<a name="l00675"></a>00675 {
<a name="l00676"></a>00676 }
<a name="l00677"></a>00677 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::iterator::iterator (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; it) :
<a name="l00678"></a>00678         dM( it.dM ),
<a name="l00679"></a>00679         dK( it.dK )
<a name="l00680"></a>00680 {
<a name="l00681"></a>00681 }
<a name="l00682"></a>00682 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::iterator::~iterator ()
<a name="l00683"></a>00683 {
<a name="l00684"></a>00684 }
<a name="l00685"></a>00685 
<a name="l00686"></a>00686 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; Sparse_matrix&lt;T&gt;::iterator::operator = (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; it)
<a name="l00687"></a>00687 {
<a name="l00688"></a>00688         dM = it.dM;
<a name="l00689"></a>00689         dK = it.dK;
<a name="l00690"></a>00690         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00691"></a>00691 }
<a name="l00692"></a>00692 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> Sparse_matrix&lt;T&gt;::iterator::operator == (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; it)<span class="keyword"> const</span>
<a name="l00693"></a>00693 <span class="keyword"></span>{
<a name="l00694"></a>00694         <span class="keywordflow">return</span> (dM == it.dM) &amp;&amp; (dK == it.dK);
<a name="l00695"></a>00695 }
<a name="l00696"></a>00696 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> Sparse_matrix&lt;T&gt;::iterator::operator != (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; it)<span class="keyword"> const</span>
<a name="l00697"></a>00697 <span class="keyword"></span>{
<a name="l00698"></a>00698         <span class="keywordflow">return</span> (dM != it.dM) || (dK != it.dK);
<a name="l00699"></a>00699 }
<a name="l00700"></a>00700 
<a name="l00701"></a>00701 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::iterator::operator* (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00702"></a>00702 <span class="keyword"></span>{
<a name="l00703"></a>00703         <span class="keywordflow">return</span> dM-&gt;dEntries[dK];
<a name="l00704"></a>00704 }
<a name="l00705"></a>00705 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::iterator::operator* (<span class="keywordtype">void</span>)
<a name="l00706"></a>00706 {
<a name="l00707"></a>00707         <span class="keywordflow">return</span> dM-&gt;dEntries[dK];
<a name="l00708"></a>00708 }
<a name="l00709"></a>00709 
<a name="l00710"></a>00710 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; Sparse_matrix&lt;T&gt;::iterator::operator++ (<span class="keywordtype">void</span>)
<a name="l00711"></a>00711 {
<a name="l00712"></a>00712         dK++;
<a name="l00713"></a>00713         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00714"></a>00714 }
<a name="l00715"></a>00715 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; Sparse_matrix&lt;T&gt;::iterator::operator++ (<span class="keywordtype">int</span>)
<a name="l00716"></a>00716 {
<a name="l00717"></a>00717         dK++;
<a name="l00718"></a>00718         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00719"></a>00719 }
<a name="l00720"></a>00720 
<a name="l00721"></a>00721 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; Sparse_matrix&lt;T&gt;::iterator::operator-- (<span class="keywordtype">void</span>)
<a name="l00722"></a>00722 {
<a name="l00723"></a>00723         dK--;
<a name="l00724"></a>00724         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00725"></a>00725 }
<a name="l00726"></a>00726 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; Sparse_matrix&lt;T&gt;::iterator::operator-- (<span class="keywordtype">int</span>)
<a name="l00727"></a>00727 {
<a name="l00728"></a>00728         dK--;
<a name="l00729"></a>00729         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00730"></a>00730 }
<a name="l00731"></a>00731 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; <a class="code" href="group__vectors.html#ga4226e5c3bf0305cf0a0459bf43564223">Sparse_matrix&lt;T&gt;::iterator::operator+= </a>(int32 n)
<a name="l00732"></a>00732 {
<a name="l00733"></a>00733         dK += n;
<a name="l00734"></a>00734         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00735"></a>00735 }
<a name="l00736"></a>00736 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; <a class="code" href="group__vectors.html#ga6c534bcb2f6acc627ea0988b2de4f73e">Sparse_matrix&lt;T&gt;::iterator::operator-= </a>(int32 n)
<a name="l00737"></a>00737 {
<a name="l00738"></a>00738         dK -= n;
<a name="l00739"></a>00739         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00740"></a>00740 }
<a name="l00741"></a>00741 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator <a class="code" href="group__vectors.html#ga9235b9ea803b8d0ef379565a3ff7dd76">Sparse_matrix&lt;T&gt;::iterator::operator + </a>(int32 n)<span class="keyword"> const</span>
<a name="l00742"></a>00742 <span class="keyword"></span>{
<a name="l00743"></a>00743         <span class="keywordflow">return</span> iterator( dM, dK + n );
<a name="l00744"></a>00744 }
<a name="l00745"></a>00745 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator <a class="code" href="group__vectors.html#ga8782aba246b1da852d9f4390d22336f8">Sparse_matrix&lt;T&gt;::iterator::operator - </a>(int32 n)<span class="keyword"> const</span>
<a name="l00746"></a>00746 <span class="keyword"></span>{
<a name="l00747"></a>00747         <span class="keywordflow">return</span> iterator( dM, dK - n );
<a name="l00748"></a>00748 }
<a name="l00749"></a>00749 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 <a class="code" href="group__vectors.html#ga8782aba246b1da852d9f4390d22336f8">Sparse_matrix&lt;T&gt;::iterator::operator - </a>(<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::iterator&amp; it)<span class="keyword"> const</span>
<a name="l00750"></a>00750 <span class="keyword"></span>{
<a name="l00751"></a>00751         <span class="keywordflow">return</span> dK - it.dK;
<a name="l00752"></a>00752 }
<a name="l00753"></a>00753 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::iterator::operator [] (int32 n)<span class="keyword"> const</span>
<a name="l00754"></a>00754 <span class="keyword"></span>{
<a name="l00755"></a>00755         <span class="keywordflow">return</span> dM[ dK + n ];
<a name="l00756"></a>00756 }
<a name="l00757"></a>00757 
<a name="l00758"></a>00758 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix&lt;T&gt;::iterator::row (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00759"></a>00759 <span class="keyword"></span>{
<a name="l00760"></a>00760         <span class="keywordflow">return</span> dM[dK].row();
<a name="l00761"></a>00761 }
<a name="l00762"></a>00762 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix&lt;T&gt;::iterator::col (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00763"></a>00763 <span class="keyword"></span>{
<a name="l00764"></a>00764         <span class="keywordflow">return</span> dM[dK].col();
<a name="l00765"></a>00765 }
<a name="l00766"></a>00766 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> T&amp; Sparse_matrix&lt;T&gt;::iterator::value (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00767"></a>00767 <span class="keyword"></span>{
<a name="l00768"></a>00768         <span class="keywordflow">return</span> dM[dK].value();
<a name="l00769"></a>00769 }
<a name="l00770"></a>00770 
<a name="l00771"></a>00771 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix&lt;T&gt;::iterator::set (int32 i, int32 j, <span class="keyword">const</span> T&amp; v)
<a name="l00772"></a>00772 {
<a name="l00773"></a>00773         dM[dK].dRow = i;
<a name="l00774"></a>00774         dM[dK].dCol = j;
<a name="l00775"></a>00775         dM[dK].dVal = v;
<a name="l00776"></a>00776 }
<a name="l00777"></a>00777 
<a name="l00778"></a>00778 
<a name="l00779"></a>00779 
<a name="l00780"></a>00780 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::const_iterator::const_iterator (<span class="keywordtype">void</span>) :
<a name="l00781"></a>00781         dM( 0 ),
<a name="l00782"></a>00782         dK( 0 )
<a name="l00783"></a>00783 {
<a name="l00784"></a>00784 }
<a name="l00785"></a>00785 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::const_iterator::const_iterator (<span class="keyword">const</span> Sparse_matrix&lt;T&gt; *m, int32 k) :
<a name="l00786"></a>00786         dM( m ),
<a name="l00787"></a>00787         dK( k )
<a name="l00788"></a>00788 {
<a name="l00789"></a>00789 }
<a name="l00790"></a>00790 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::const_iterator::const_iterator (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; it) :
<a name="l00791"></a>00791         dM( it.dM ),
<a name="l00792"></a>00792         dK( it.dK )
<a name="l00793"></a>00793 {
<a name="l00794"></a>00794 }
<a name="l00795"></a>00795 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; Sparse_matrix&lt;T&gt;::const_iterator::~const_iterator ()
<a name="l00796"></a>00796 {
<a name="l00797"></a>00797 }
<a name="l00798"></a>00798 
<a name="l00799"></a>00799 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator = (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; it)
<a name="l00800"></a>00800 {
<a name="l00801"></a>00801         dM = it.dM;
<a name="l00802"></a>00802         dK = it.dK;
<a name="l00803"></a>00803         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00804"></a>00804 }
<a name="l00805"></a>00805 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> Sparse_matrix&lt;T&gt;::const_iterator::operator == (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; it)<span class="keyword"> const</span>
<a name="l00806"></a>00806 <span class="keyword"></span>{
<a name="l00807"></a>00807         <span class="keywordflow">return</span> (dM == it.dM) &amp;&amp; (dK == it.dK);
<a name="l00808"></a>00808 }
<a name="l00809"></a>00809 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keywordtype">bool</span> Sparse_matrix&lt;T&gt;::const_iterator::operator != (<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; it)<span class="keyword"> const</span>
<a name="l00810"></a>00810 <span class="keyword"></span>{
<a name="l00811"></a>00811         <span class="keywordflow">return</span> (dM != it.dM) || (dK != it.dK);
<a name="l00812"></a>00812 }
<a name="l00813"></a>00813 
<a name="l00814"></a>00814 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator* (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00815"></a>00815 <span class="keyword"></span>{
<a name="l00816"></a>00816         <span class="keywordflow">return</span> dM-&gt;dEntries[dK];
<a name="l00817"></a>00817 }
<a name="l00818"></a>00818 
<a name="l00819"></a>00819 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator++ (<span class="keywordtype">void</span>)
<a name="l00820"></a>00820 {
<a name="l00821"></a>00821         dK++;
<a name="l00822"></a>00822         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00823"></a>00823 }
<a name="l00824"></a>00824 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator++ (<span class="keywordtype">int</span>)
<a name="l00825"></a>00825 {
<a name="l00826"></a>00826         dK++;
<a name="l00827"></a>00827         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00828"></a>00828 }
<a name="l00829"></a>00829 
<a name="l00830"></a>00830 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator-- (<span class="keywordtype">void</span>)
<a name="l00831"></a>00831 {
<a name="l00832"></a>00832         dK--;
<a name="l00833"></a>00833         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00834"></a>00834 }
<a name="l00835"></a>00835 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator-- (<span class="keywordtype">int</span>)
<a name="l00836"></a>00836 {
<a name="l00837"></a>00837         dK--;
<a name="l00838"></a>00838         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00839"></a>00839 }
<a name="l00840"></a>00840 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; <a class="code" href="group__vectors.html#ga4226e5c3bf0305cf0a0459bf43564223">Sparse_matrix&lt;T&gt;::const_iterator::operator+= </a>(int32 n)
<a name="l00841"></a>00841 {
<a name="l00842"></a>00842         dK += n;
<a name="l00843"></a>00843         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00844"></a>00844 }
<a name="l00845"></a>00845 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; <a class="code" href="group__vectors.html#ga6c534bcb2f6acc627ea0988b2de4f73e">Sparse_matrix&lt;T&gt;::const_iterator::operator-= </a>(int32 n)
<a name="l00846"></a>00846 {
<a name="l00847"></a>00847         dK -= n;
<a name="l00848"></a>00848         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00849"></a>00849 }
<a name="l00850"></a>00850 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator <a class="code" href="group__vectors.html#ga9235b9ea803b8d0ef379565a3ff7dd76">Sparse_matrix&lt;T&gt;::const_iterator::operator + </a>(int32 n)<span class="keyword"> const</span>
<a name="l00851"></a>00851 <span class="keyword"></span>{
<a name="l00852"></a>00852         <span class="keywordflow">return</span> const_iterator( dM, dK + n );
<a name="l00853"></a>00853 }
<a name="l00854"></a>00854 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator <a class="code" href="group__vectors.html#ga8782aba246b1da852d9f4390d22336f8">Sparse_matrix&lt;T&gt;::const_iterator::operator - </a>(int32 n)<span class="keyword"> const</span>
<a name="l00855"></a>00855 <span class="keyword"></span>{
<a name="l00856"></a>00856         <span class="keywordflow">return</span> const_iterator( dM, dK - n );
<a name="l00857"></a>00857 }
<a name="l00858"></a>00858 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 <a class="code" href="group__vectors.html#ga8782aba246b1da852d9f4390d22336f8">Sparse_matrix&lt;T&gt;::const_iterator::operator - </a>(<span class="keyword">const</span> <span class="keyword">typename</span> Sparse_matrix&lt;T&gt;::const_iterator&amp; it)<span class="keyword"> const</span>
<a name="l00859"></a>00859 <span class="keyword"></span>{
<a name="l00860"></a>00860         <span class="keywordflow">return</span> dK - it.dK;
<a name="l00861"></a>00861 }
<a name="l00862"></a>00862 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> Sparse_matrix_entry&lt;T&gt;&amp; Sparse_matrix&lt;T&gt;::const_iterator::operator [] (int32 n)<span class="keyword"> const</span>
<a name="l00863"></a>00863 <span class="keyword"></span>{
<a name="l00864"></a>00864         <span class="keywordflow">return</span> dM[ dK + n ];
<a name="l00865"></a>00865 }
<a name="l00866"></a>00866 
<a name="l00867"></a>00867 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix&lt;T&gt;::const_iterator::row (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00868"></a>00868 <span class="keyword"></span>{
<a name="l00869"></a>00869         <span class="keywordflow">return</span> dM[dK].row();
<a name="l00870"></a>00870 }
<a name="l00871"></a>00871 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; int32 Sparse_matrix&lt;T&gt;::const_iterator::col (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00872"></a>00872 <span class="keyword"></span>{
<a name="l00873"></a>00873         <span class="keywordflow">return</span> dM[dK].col();
<a name="l00874"></a>00874 }
<a name="l00875"></a>00875 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">const</span> T&amp; Sparse_matrix&lt;T&gt;::const_iterator::value (<span class="keywordtype">void</span>)<span class="keyword"> const</span>
<a name="l00876"></a>00876 <span class="keyword"></span>{
<a name="l00877"></a>00877         <span class="keywordflow">return</span> dM[dK].value();
<a name="l00878"></a>00878 }
<a name="l00879"></a>00879 
<a name="l00880"></a>00880 } <span class="comment">// namespace nih</span>
</pre></div></div>
</div>
  <div id="nav-path" class="navpath">
    <ul>
      <li class="navelem"><b>sparse_matrix.h</b>      </li>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>


    <li class="footer">Generated on Thu Dec 15 2011 11:56:19 for nih by
    <a href="http://www.doxygen.org/index.html">
    <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.5.1 </li>
   </ul>
 </div>


</body>
</html>
